Reconstructing a Simple Polygon from Its Angles
نویسندگان
چکیده
We study the problem of reconstructing a simple polygon from angles measured at the vertices of the polygon. We assume that at each vertex, a sensing device returns the sequence of angles between each pair of vertices that are visible. We prove that the sequence of angle measurements at all vertices of a simple polygon in cyclic order uniquely determines the polygon up to similarity. Furthermore, we propose an algorithm that reconstructs the polygon from this information in polynomial time.
منابع مشابه
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles
We study the problem of reconstructing a simple polygon P from the visibility angles measured at the vertices of P and from the cyclically ordered vertices of P along its boundary. Precisely, for an unknown simple polygon P of n vertices, suppose we are given (1) the vertices ordered counterclockwise (CCW) along the boundary of P , and (2) for each vertex v of P , the angles between any two adj...
متن کاملSimple Agents Learn to Find Their Way: An Introduction on Mapping Polygons
This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight lines inside a polygon, using their sensors to gather local observations at each vertex. Our attention revolves around the question whether a given configuration of sensors and movement capabilities of the agents allows...
متن کاملMapping Polygons
This thesis is concerned with simple agents that move from vertex to vertex along straight lines inside a simple polygon with the goal of reconstructing the visibility graph. The visibility graph has a node for each vertex of the polygon with an edge between two nodes if the corresponding vertices see each other, i.e., if they can be connected by a straight line inside the polygon. While at a v...
متن کاملReconstructing Visibility Graphs with Simple Robots
We consider the problem of finding a minimalistic configuration of sensors that enable a simple robot inside an initially unknown polygon P on n vertices to reconstruct the visibility graph of P . The robot can sense features of its environment through its sensors, and it is allowed to move from vertex to vertex. We aim at understanding which sensorial capabilities are sufficient for the recons...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010